A fast algorithm for computing distance spectrum of convolutional codes
نویسندگان
چکیده
منابع مشابه
Distance Spectrum of Channel Trellis Codes on Precoded Partial-response 1-d Channel
Distance spectrum is the main factor in determining the event error probability when maximum-likelihood decoding is used for convolutional codes [13]. In this paper we compute the distance spectrum for the best R=1/N channel codes obtained using convolutional (linear trellis) codes together with known offset sequence addition on precoded partial-response 1−D channel proposed in [4]. To this end...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملDistance spectrum analysis of space-time trellis-coded Modulations in quasi-static Rayleigh-fading channels
In this correspondence, we propose an algorithm for computing the distance spectrum of a space–time trellis code achieving maximal diversity gain in quasi-static fading channels. We further present a state reduction technique for trellis codes that can reduce the complexity of the distance spectrum computation. We provide numerical results supporting the empirical evidence that a truncated unio...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 1989